High Dimensional Correspondences from Low Dimensional Manifolds - An Empirical Comparison of Graph-Based Dimensionality Reduction Algorithms

نویسندگان

  • Ribana Roscher
  • Falko Schindler
  • Wolfgang Förstner
چکیده

Linear methods yield data points xn = r1φn,1 +r ∗ 2φn,2 + . . .+ rMφn,M = R φn, which are d-dimensional linear combinations of the original D-dimensional data points φn. . Principal Component Analysis (PCA, Jolliffe (2002)): Preserves the global covariance structure by decomposition of the covariance matrix Σφ,φ = RS R. . Metric Multidimensional Scaling (MDS, Cox & Cox (1994)): Preserves inner products between data points by decomposing the Gram matrix K nm = φn · φm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semisupervised alignment of manifolds

In this paper, we study a family of semisupervised learning algorithms for “aligning” different data sets that are characterized by the same underlying manifold. The optimizations of these algorithms are based on graphs that provide a discretized approximation to the manifold. Partial alignments of the data sets—obtained from prior knowledge of their manifold structure or from pairwise correspo...

متن کامل

Non-linear Dimensionality Reduction by Locally Linear Isomaps

Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Local Linear Embedding and Laplacian Eigenmaps. Isomaps are able to reliably recover lowdimensional nonlinear structures in high-dimensional data sets, but suffer from the problem of short-circuiting, which occurs when t...

متن کامل

Fast Training of Graph-Based Algorithms for Nonlinear Dimensionality Reduction

Introduction Dimensionality reduction algorithms have long been used either for exploratory analysis of a high-dimensional dataset, to reveal structure such as clustering, or as a preprocessing step, by extracting low-dimensional features that are useful for classification or other tasks. Here we focus on dimensionality reduction algorithms where a dataset consisting of N objects is represented...

متن کامل

Steel Consumption Forecasting Using Nonlinear Pattern Recognition Model Based on Self-Organizing Maps

Steel consumption is a critical factor affecting pricing decisions and a key element to achieve sustainable industrial development. Forecasting future trends of steel consumption based on analysis of nonlinear patterns using artificial intelligence (AI) techniques is the main purpose of this paper. Because there are several features affecting target variable which make the analysis of relations...

متن کامل

An Automatic and Adaptive Multi-manifolds Learning Algorithm

Isomap is a classic and representative manifold learning algorithm for nonlinear dimensionality reduction, which aims to circumvent the problem of “the curse of dimensionality” and attempts to recover the intrinsic structure hidden in high-dimensional data based on the assumption that data lie in or near a single manifold. However, Isomap fails to work when data set consists of multi-clusters o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010